On Diameter Veri cation and Boolean Matrix Multiplication
نویسندگان
چکیده
We present a practical algorithm that veri es whether a graph has diameter 2 in time O n= log n . A slight adaptation of this algorithm yields a boolean matrix multiplication algorithm which runs in the same time bound; thereby allowing us to compute transitive closure and verify that the diameter of a graph is d, for any constant d, in O n= log n time.
منابع مشابه
Veri cation of Arithmetic Functions with Binary Moment Diagrams
Binary Moment Diagrams (BMDs) provide a canonical representations for linear functions similar to the way Binary Decision Diagrams (BDDs) represent Boolean functions. Within the class of linear functions, we can embed arbitary functions from Boolean variables to real, rational, or integer values. BMDs can thus model the functionality of data path circuits operating over word level data. Many im...
متن کاملDense matrix operations on a torus and a boolean cube
Algorithms for matrix multiplication and for Gauss-Jordan and Gaussian elimination on dense matrices on a torus and a boolean cube are presented and analyzed with respect to communication and arithmetic complexity. The number of elements of the matrices is assumed to be larger than the number of nodes in the processing system. The algorithms for matrix multiplication, triangulation, and forward...
متن کاملTowards a Verification Technique for Large Synchronous Circuits
We present a symbolic simulation based veri cation approach which can be applied to large synchronous circuits A new technique to encode the state and input constraints as parametric Boolean expressions over the state and input variables is used to make our symbolic simulation based veri cation approach e cient The constraints which are encoded through parametric Boolean expressions can involve...
متن کاملA Bit-Vector Algebra for Binary Moment Diagrams
Multiplicative Binary Moment Diagram (*BMD) is a new representation that inherits from BDD. *BMDs map Boolean variables to integer values and so they are well-suited to handle a hierarchical veri-cation methodology. In this paper we experiment this representation to verify sequential arithmetic circuits. We extend *BMDs and provide an algebra that includes main operators commonly used at the bi...
متن کاملVeri cation of Java Programs using Symbolic Execution and Invariant Generation Corina S
Software veri cation is recognized as an important and difcult problem. We present a novel framework, based on symbolic execution, for the automated veri cation of software. The framework uses annotations in the form of method speci cations and loop invariants. We present a novel iterative technique that uses invariant strengthening and approximation for discovering these loop invariants automa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995